On Positive Matrices Which Have a Positive Smith Normal Form
نویسنده
چکیده
It is known that any symmetric matrix M with entries in R[x] and which is positive semi-definite for any substitution of x ∈ R, has a Smith normal form whose diagonal coefficients are constant sign polynomials in R[x]. We generalize this result by considering a symmetric matrix M with entries in a formally real principal domain A, we assume that M is positive semi-definite for any ordering on A and, under one additionnal hypothesis concerning non-real primes, we show that the Smith normal of M is positive, up to association. Counterexamples are given when this last hypothesis is not satisfied. We give also a partial extension of our results to the case of Dedekind domains.
منابع مشابه
On p-semilinear transformations
In this paper, we introduce $p$-semilinear transformations for linear algebras over a field ${bf F}$ of positive characteristic $p$, discuss initially the elementary properties of $p$-semilinear transformations, make use of it to give some characterizations of linear algebras over a field ${bf F}$ of positive characteristic $p$. Moreover, we find a one-to-one correspondence between $p$-semiline...
متن کاملA note on positive deniteness and stability of interval matrices
It is proved that by using bounds of eigenvalues of an interval matrix, someconditions for checking positive deniteness and stability of interval matricescan be presented. These conditions have been proved previously with variousmethods and now we provide some new proofs for them with a unity method.Furthermore we introduce a new necessary and sucient condition for checkingstability of interval...
متن کاملParallel Algorithm for Computing the Smith Normal Form of Large Matrices
Smith normal form computation has many applications in group theory, module theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult problem to compute the Smith normal form of large dense matrices. The computation has two main problems: the high execution time and the memory requirements, ...
متن کاملParallel Algorithms for Computing the Smith Normal Form of Large Matrices
Smith normal form computation has many applications in group theory, module theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult problem to compute the Smith normal form of large dense matrices. The computation has two main problems: the high execution time and the memory requirements, ...
متن کاملGyrovector Spaces on the Open Convex Cone of Positive Definite Matrices
In this article we review an algebraic definition of the gyrogroup and a simplified version of the gyrovector space with two fundamental examples on the open ball of finite-dimensional Euclidean spaces, which are the Einstein and M"{o}bius gyrovector spaces. We introduce the structure of gyrovector space and the gyroline on the open convex cone of positive definite matrices and explore its...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009